A comparison of centrality measures and their role in controlling the spread in epidemic networks

The ranking of nodes in a network according to their centrality or "importance” is a classic problem that has attracted the interest of different scientific communities in the last decades. The current COVID-19 pandemic has recently rejuvenated the interest in this problem, as it informs the selection of which individuals should be tested in a population of asymptomatic individuals, or which individuals should be vaccinated first. Motivated by these issues, in this paper we review some popular methods for node ranking in undirected unweighted graphs, and compare their performance in a benchmark realistic network that takes into account the community-based structure of society. In particular, we use the information of the relevance of individuals in the network to take a control decision, i.e., which individuals should be tested, and possibly quarantined. Finally, we also review the extension of these ranking methods to weighted graphs, and explore the importance of weights in a contact network by exhibiting a toy model and comparing node rankings for this case in the context of disease spread. [ FROM AUTHOR] Copyright of International Journal of Control is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full . (Copyright applies to all s.)

Kemeny-based testing for COVID-19.

Testing, tracking and tracing abilities have been identified as pivotal in helping countries to safely reopen activities after the first wave of the COVID-19 virus. Contact tracing apps give the unprecedented possibility to reconstruct graphs of daily contacts, so the question is: who should be tested? As human contact networks are known to exhibit community structure, in this paper we show that the Kemeny constant of a graph can be used to identify and analyze bridges between communities in a graph. Our 'Kemeny indicator' is the value of the Kemeny constant in the new graph that is obtained when a node is removed from the original graph. We show that testing individuals who are associated with large values of the Kemeny indicator can help in efficiently intercepting new virus outbreaks, when they are still in their early stage. Extensive simulations provide promising results in early identification and in blocking the possible 'super-spreaders' links that transmit disease between different communities.